Computer Adaptive Testing Using Upper-Confidence Bound Algorithm for Formative Assessment
نویسندگان
چکیده
منابع مشابه
Computer support for formative assessment
This paper describes research investigating assessment and examination of Business students. The overall goal of the research is the design of computer applications supporting collaborative learning and formative assessment. The question guiding the research presented in this paper was: How can computers support examination of business students? To approach this question, the research was condu...
متن کاملFormative Automated Computer Testing (FACT)
This study describes the context for the development of a tool to formatively assess information technology skills of students. The tool provides a reliable and valid assessment of word processing competency, utilizing automation to apply the test instrument via the Microsoft Office package. Tests can be designed directly by tutors, and delivered via a network. Evaluation of the tests suggests ...
متن کاملElectronic Quality of Life Assessment Using Computer-Adaptive Testing
BACKGROUND Quality of life (QoL) questionnaires are desirable for clinical practice but can be time-consuming to administer and interpret, making their widespread adoption difficult. OBJECTIVE Our aim was to assess the performance of the World Health Organization Quality of Life (WHOQOL)-100 questionnaire as four item banks to facilitate adaptive testing using simulated computer adaptive test...
متن کاملLinear Upper Confidence Bound Algorithm for Contextual Bandit Problem with Piled Rewards
We study the contextual bandit problem with linear payoff function. In the traditional contextual bandit problem, the algorithm iteratively chooses an action based on the observed context, and immediately receives a reward for the chosen action. Motivated by a practical need in many applications, we study the design of algorithms under the piled-reward setting, where the rewards are received as...
متن کاملOn Upper-Confidence Bound Policies for Switching Bandit Problems
Many problems, such as cognitive radio, parameter control of a scanning tunnelling microscope or internet advertisement, can be modelled as non-stationary bandit problems where the distributions of rewards changes abruptly at unknown time instants. In this paper, we analyze two algorithms designed for solving this issue: discounted UCB (D-UCB) and sliding-window UCB (SW-UCB). We establish an up...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Sciences
سال: 2019
ISSN: 2076-3417
DOI: 10.3390/app9204303